A min-max result on catacondensed benzenoid graphs
نویسندگان
چکیده
The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed benzenoid graph equals the dimension of a largest induced hypercube of its resonance graph.
منابع مشابه
On the Clar Number of Benzenoid Graphs
A Clar set of a benzenoid graph B is a maximum set of independent alternating hexagons over all perfect matchings of B. The Clar number of B, denoted by Cl(B), is the number of hexagons in a Clar set for B. In this paper, we first prove some results on the independence number of subcubic trees to study the Clar number of catacondensed benzenoid graphs. As the main result of the paper we prove a...
متن کاملFibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
The Fibonacci dimension fdim(G) of a graph G was introduced in [1] as the smallest integer d such that G admits an isometric embedding into Γd, the d-dimensional Fibonacci cube. The Fibonacci dimension of the resonance graphs of catacondensed benzenoid systems is studied. This study is inspired by the fact, that the Fibonacci cubes are precisely the resonance graphs of a subclass of the catacon...
متن کاملOn the Fibonacci Dimension of Partial Cubes
The Fibonacci dimension fdim(G) of a graph G was introduced in [7] as the smallest integer d such that G admits an isometric embedding into Qd, the d-dimensional Fibonacci cube. A somewhat new combinatorial characterization of the Fibonacci dimension is given, which enables more comfortable proofs of some previously known results. In the second part of the paper the Fibonacci dimension of the r...
متن کاملOn discriminativity of Zagreb indices
Zagreb indices belong to better known and better researched topological indices. We investigate here their ability to discriminate among benzenoid graphs and arrive at some quite unexpected conclusions. Along the way we establish tight (and sometimes sharp) lower and upper bounds on various classes of benzenoids.
متن کاملBinary coding of algebraic Kekulé structures of catacondensed benzenoid graphs
The algebraic Kekulé structure of a finite catacondensed benzenoid graph with h hexagons is described by a binary code of length h. The procedure can be reversed, any (algebraic) Kekulé structure can be recovered from its binary code. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002